Bivariate Factorizations Connecting Dickson Polynomials and Galois Theory

نویسندگان

  • Shreeram S. Abhyankar
  • Stephen D. Cohen
  • Michael E. Zieve
چکیده

In his Ph.D. Thesis of 1897, Dickson introduced certain permutation polynomials whose Galois groups are essentially the dihedral groups. These are now called Dickson polynomials of the first kind, to distinguish them from their variations introduced by Schur in 1923, which are now called Dickson polynomials of the second kind. In the last few decades there have been extensive investigations of both of these types, which are related to the classical Chebyshev polynomials. We give new bivariate factorizations involving both types of Dickson polynomials. These factorizations demonstrate certain isomorphisms between dihedral groups and orthogonal groups, and lead to the construction of explicit equations with orthogonal groups as Galois groups.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring Dickson polynomials over finite fields

We derive the factorizations of the Dickson polynomials Dn(X, a) and En(X, a), and of the bivariate Dickson polynomials Dn(X, a) − Dn(Y, a), over any finite field. Our proofs are significantly shorter and more elementary than those previously known.

متن کامل

Factoring Dickson polynomials over nite elds

We derive the factorizations of the Dickson polynomials D n (X; a) and E n (X; a), and of the bivariate Dickson polynomials D n (X; a) ? D n (Y; a), over any nite eld. Our proofs are signiicantly shorter and more elementary than those previously known.

متن کامل

Bivariate factorizations via Galois theory, with application to exceptional polynomials

We present a method for factoring polynomials of the shape f(X)− f(Y ), where f is a univariate polynomial over a field k. We then apply this method in the case when f is a member of the infinite family of exceptional polynomials we discovered jointly with H. Lenstra in 1995; factoring f(X)−f(Y ) in this case was posed as a problem by S. Cohen shortly after the discovery of these polynomials.

متن کامل

Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields

We give, over a finite field Fq, explicit factorizations into a product of irreducible polynomials, of the cyclotomic polynomials of order 3 · 2, the Dickson polynomials of the first kind of order 3 · 2 and the Dickson polynomials of the second kind of order 3 · 2 − 1.

متن کامل

Sparse multivariate factorization by mean of a few bivariate factorizations

We describe an algorithm to factor sparse multivariate polynomials usingO(d) bivariate factorizations where d is the number of variables. This algorithm is implemented in the Giac/Xcas computer algebra system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000